Enhanced Nearest Neighbour
نویسندگان
چکیده
Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that eecient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have been used in previous R*-tree work, which we prove cannot improve on the pruning power during a search.
منابع مشابه
Fuzzy-rough nearest neighbour classification and prediction
In this paper, we propose a nearest neighbour algorithm that uses the lower and upper approximations from fuzzy rough set theory in order to classify test objects, or predict their decision value. It is shown experimentally that our method outperforms other nearest neighbour approaches (classical, fuzzy and fuzzy-rough ones) and that it is competitive with leading classification and prediction ...
متن کاملAeóû Ø Ôôöøññòø Ó Óñôùøøö Ëëëëòòò¸éùùùò Ååöý ² Ï×ø¹ Ðð Óððððð¸íòòúö××øý Ó Äóòòóòº
The automatic categorisation of web documents is becoming crucial for organising the huge amount of information available in the Internet. We are facing a new challenge due to the fact that web documents have a rich structure and are highly heterogeneous. Two ways to respond to this challenge are (1) using a representation of the content of web documents that captures these two characteristics ...
متن کاملOn the construction of complete and partial nearest neighbour balanced designs
In this paper, methods for constructing two dimensional nearest neighbour balanced (NNB) designs are considered. The methods given by Afsarinejad and Seeger (1988) are extended to give a new family of nearest neighbour balanced designs. Both nearest neighbour balanced designs with and without borders are constructed. A method of construction of a class of partial nearest neighbour balanced (PNN...
متن کاملThe Two Dimensional Antiferromagnetic Heisenberg Model with next Nearest Neighbour Ising Exchange
We have studied the S = 1/2 antiferromagnetic Heisenberg model in two dimensions, with an additional Ising next-nearest neighbour interaction. The next-nearest neighbour Ising interaction breaks the isotropy in spin space, for a ferromagnetic next-nearest neighbour interaction the system will order antiferromagnetically along the z axis. Antiferromagnetic next-nearest neighbour interactions wil...
متن کاملNearest Neighbour Strategies for Image Understanding
Nearest Neighbour algorithms for pattern recognition have been widely studied. It is now well-established that they offer a quick and reliable method of data classification. In this paper we further develop the basic definition of the standard k-nearest neighbour algorithm to include the ability to resolve conflicts when the highest number of nearest neighbours are found for more than one train...
متن کاملExplicit laws of large numbers for random nearest-neighbour type graphs
We give laws of large numbers (in the Lp sense) for the total length of the k-nearest neighbours (directed) graph and the j-th nearest neighbour (directed) graph in Rd, d ∈ N, with power-weighted edges. We deduce a law of large numbers for the standard nearest neighbour (undirected) graph. We give the limiting constants, in the case of uniform random points in (0, 1)d, explicitly. Also, we give...
متن کامل